package com.sxkiler.demo.medium;

import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;
import java.util.*;
import com.sxkiler.demo.model.*;

/**
surrounded-regions=被围绕的区域
<p>给定一个二维的矩阵，包含&nbsp;<code>'X'</code>&nbsp;和&nbsp;<code>'O'</code>（<strong>字母 O</strong>）。</p>

<p>找到所有被 <code>'X'</code> 围绕的区域，并将这些区域里所有的&nbsp;<code>'O'</code> 用 <code>'X'</code> 填充。</p>

<p><strong>示例:</strong></p>

<pre>X X X X
X O O X
X X O X
X O X X
</pre>

<p>运行你的函数后，矩阵变为：</p>

<pre>X X X X
X X X X
X X X X
X O X X
</pre>

<p><strong>解释:</strong></p>

<p>被围绕的区间不会存在于边界上，换句话说，任何边界上的&nbsp;<code>'O'</code>&nbsp;都不会被填充为&nbsp;<code>'X'</code>。 任何不在边界上，或不与边界上的&nbsp;<code>'O'</code>&nbsp;相连的&nbsp;<code>'O'</code>&nbsp;最终都会被填充为&nbsp;<code>'X'</code>。如果两个元素在水平或垂直方向相邻，则称它们是&ldquo;相连&rdquo;的。</p>

 */
public class solve {
    

    class Solution {
        public void solve(String[][] param0) {

        }
    }

    @Test
    public void test(){
        Solution solution = new Solution();
        /**
        [["X","X","X","X"],["X","O","O","X"],["X","X","O","X"],["X","O","X","X"]]
        */
        //int [] num1 = new int[]{1,3};
        //int [] num2 = new int[]{2};
        //Assertions.assertEquals(solution.{{questionName}}(num1,num2),2);
    }
}

